Range closest-pair search in higher dimensions
نویسندگان
چکیده
منابع مشابه
On Spatial-Range Closest-Pair Query
An important query for spatial database research is to find the closest pair of objects in a given space. Existing work assumes two objects of the closest pair come from two different data sets indexed by R-trees. The closest pair in the whole space will be found via an optimzed R-tree join technique. However, this technique doesn’t perform well when the two data sets are identical. And it does...
متن کاملNew bounds for range closest-pair problems
Given a dataset S of points in R, the range closest-pair (RCP) problem aims to preprocess S into a data structure such that when a query range X is specified, the closest-pair in S ∩ X can be reported efficiently. The RCP problem can be viewed as a range-search version of the classical closestpair problem, and finds applications in many areas. Due to its non-decomposability, the RCP problem is ...
متن کاملClosest Point Search in High Dimensions
The problem of nding the closest point in high-dimensional spaces is common in computational vision. Unfortunately, the complexity of most existing search algorithms , such as k-d tree and R-tree, grows exponentially with dimension, making them impractical for di-mensionality above 15. In nearly all applications, the closest point is of interest only if it lies within a user speciied distance. ...
متن کاملPair Correlations of Sequences in Higher Dimensions
We consider a system of “generalised linear forms” defined on a subset x = (xij) of Rd by
متن کاملTime-Windowed Closest Pair
Given a set of points in any constant dimension, each of which is associated with a time during which that point is active, we design a data structure with O(n log n) space that can find the closest pair of active points within a query interval of time in O(log log n) time using a quadtree-based approach in the word-RAM model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2020
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2020.101669